A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
نویسندگان
چکیده
The reconstruction of destroyed paper documents became of more interest during the last years. On the one hand it (often) occurs that documents are destroyed by mistake while on the other hand this type of application is relevant in the fields of forensics and archeology, e.g., for evidence or restoring ancient documents. Within this paper, we present a new approach for restoring cross-cut shredded text documents, i.e., documents which were mechanically cut into rectangular shreds of (almost) identical shape. For this purpose we present a genetic algorithm that is extended to a memetic algorithm by embedding a (restricted) variable neighborhood search (VNS). Additionally, the memetic algorithm’s final solution is further improved by an enhanced version of the VNS. Computational experiments suggest that the newly developed algorithms are not only competitive with the so far best known algorithms for the reconstruction of cross-cut shredded documents but clearly outperform them.
منابع مشابه
Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive
The reconstruction of shredded documents is of high interest not only in forensic science but also when documents are destroyed unintentionally. Reconstructing cross-cut shredded documents (RCCSTD) is particularly difficult since the documents are cut into rectangular pieces of equal size. Since shape information along the edges—in contrast to hand torn pieces—cannot be exploited, the reconstru...
متن کاملAn alternative clustering approach for reconstructing cross cut shredded text documents
In this paper, we propose a clustering approach for solving the problem of reconstructing cross-cut shredded documents. This problem is important in the field of forensic science. Unlike other clustering approaches which are applied as a preprocessing step before the actual reconstruction algorithms, our clustering approach is part of the reconstruction process itself. We define a new cost func...
متن کاملEnhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents
In this work the concept of a trie-based complete solution archive in combination with a genetic algorithm is applied to the Reconstruction of Cross-Cut Shredded Text Documents (RCCSTD) problem. This archive is able to detect and subsequently convert duplicates into new yet unvisited solutions. Cross-cut shredded documents are documents that are cut into rectangular pieces of equal size and sha...
متن کاملSemi-Automatic Reconstruction of Cross-Cut Shredded Documents
We propose a new approach for cross-cut shredded document reconstruction and evaluate it on the DARPA Shredder Challenge dataset. We begin by pre-processing chads. A set of costs based on shape (gaps, overlaps, edge similarity), graphical content (ruling line alignment, text line alignment), and semantic content (character and letter combinations) is calculated and used to rank putative chad ma...
متن کاملReconstructing Shredded Documents
This project looks at the challenges involved in the automatic reconstruction of strip (vertically cut) and cross (both vertically and horizontally cut) shredded documents. The unshredding problem is of interest in the fields of forensics, investigative sciences, and archaeology. All stages of the unshredding pipeline are analysed, starting from scanned images of shreds and ending with reconstr...
متن کامل